The complexity of some complementation problems

The Complexity of Some Complementation Problems

the effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing

بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...

Complexity of Some Geometric Problems

We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on the rectilinear crossing number and intersection graphs of line segments, we argue that there is a need to recognize this level of complexity as its own class.

The Complexity of Some Topological Inference Problems

We give some lower bounds on the description, sample, and computational complexities of the problems of computing dimension, homology, and topological type of a manifold, and detecting singularities for a polyhedron.

The complexity of some regex crossword problems

In a typical regular expression (regex) crossword puzzle, you are given two nonempty lists R1, . . . , Rm and C1, . . . , Cn of regular expressions over some alphabet, and your goal is to fill in an m× n grid with letters from that alphabet so that the string formed by the ith row is in L(Ri), and the string formed by the jth column is in L(Cj), for all 1 ≤ i ≤ m and 1 ≤ j ≤ n. Such a grid is a...